Coincidences of a Shifted Hexagonal Lattice and the Hexagonal Packing
نویسندگان
چکیده
منابع مشابه
Revisiting the Hexagonal Lattice: on Optimal Lattice Circle Packing
In this note we give a simple proof of the classical fact that the hexagonal lattice gives the highest density circle packing among all lattices in R2. With the benefit of hindsight, we show that the problem can be restricted to the important class of well-rounded lattices, on which the density function takes a particularly simple form. Our proof emphasizes the role of well-rounded lattices for...
متن کاملWideband Dispersion Compensation in Hexagonal Lattice Photonic Crystal Fiber
In this paper, a new structure is provided for the dispersion compensating photonic crystal fibers in order to broaden the chromatic dispersion and increase the dispersion compensating capability in a wide wavelength range. In the structure, putting elliptical holes in the first ring of the inner core clad of a dispersion compensating fiber of the hexagonal lattice, increases the wavelength ran...
متن کاملDistance Coloring of the Hexagonal Lattice
Motivated by the frequency assignment problem we study the ddistant coloring of the vertices of an infinite plane hexagonal lattice H. Let d be a positive integer. A d-distant coloring of the lattice H is a coloring of the vertices of H such that each pair of vertices distance at most d apart have different colors. The d-distant chromatic number of H, denoted χd(H), is the minimum number of col...
متن کاملOn sublattices of the hexagonal lattice
How many sublattices of index N are there in the planar hexagonal lattice? Which of them are the best from the point of view of packing density, signal-to-noise ratio, or energy? We answer the first question completely and give partial answers to the other questions.
متن کاملOn the packing chromatic number of Cartesian products, hexagonal lattice, and trees
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several lower and upper bounds are obtained for the packing chromatic number of Cartesian products of graphs. It is proved that the packing chromatic number of the infinite hexagonal lattice lies between 6 and 8. Optimal lower a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Physica Polonica A
سال: 2014
ISSN: 0587-4246,1898-794X
DOI: 10.12693/aphyspola.126.516